Probabilistic Logical Characterization
نویسندگان
چکیده
Probabilistic automata exhibit both probabilistic and non-deterministic choice. They are therefore a powerful semantic foundation for modeling concurrent systems with random phenomena arising in many applications ranging from artificial intelligence, security, systems biology to performance modeling. Several variations of bisimulation and simulation relations have proved to be useful as means to abstract and compare different automata. This paper develops a taxonomy of logical characterizations of these relations on image-finite and image-infinite probabilistic automata.
منابع مشابه
Logical Characterization of Trace Metrics
In this paper we continue our research line on logical characterizations of behavioral metrics obtained from the definition of a metric over the set of logical properties of interest. This time we provide a characterization of both strong and weak trace metric on nondeterministic probabilistic processes, based on a minimal boolean logic L which we prove to be powerful enough to characterize str...
متن کاملLogical Characterization of Bisimulation for Transition Relations over Probability Distributions with Internal Actions
In recent years the study of probabilistic transition systems has shifted to transition relations over distributions to allow for a smooth adaptation of the standard non-probabilistic apparatus. In this paper we study transition relations over probability distributions in a setting with internal actions. We provide new logics that characterize probabilistic strong, weak and branching bisimulati...
متن کاملUse of a metric in supervisory control of probabilistic discrete event systems
This work represents a natural extension of our work on optimal probabilistic supervisory control of probabilistic discrete event systems (PDESs). In that work, a pseudometric on the initial states of two probabilistic automata that represent probabilistic systems is used to measure the distance between two systems. The pseudometric is given a fixed point characterization. This paper gives a lo...
متن کاملLogical Characterization of Bisimulation Metrics
Bisimulation metrics provide a robust and accurate approach to study the behavior of nondeterministic probabilistic processes. In this paper, we propose a logical characterization of bisimulation metrics based on a simple probabilistic variant of the Hennessy-Milner logic. Our approach is based on the novel notions of mimicking formulae and distance between formulae. The former are a weak versi...
متن کاملA Logical Characterization of Bisimulation for Labeled Markov Processes
This paper gives a logical characterization of probabilistic bisimulation for Markov processes introduced in BDEP97]. The thrust of that work was an extension of the notion of bisimulation to systems with continuous state spaces; for example for systems where the state space is the real numbers. In the present paper we study the logical characterization of probabilistic bisimulation for such ge...
متن کاملA pseudometric in supervisory control of probabilistic discrete event systems
The focus of this paper is the pseudometric used as a key concept in our previous work on optimal supervisory control of probabilistic discrete event systems. The pseudometric is employed to measure the behavioural similarity between probabilistic systems, and initially was defined as a greatest fixed point of a monotone function. This paper further characterizes the pseudometric. First, it giv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 209 شماره
صفحات -
تاریخ انتشار 2011